Machine-based methods in parameterized complexity theory
نویسندگان
چکیده
منابع مشابه
Machine-based methods in parameterized complexity theory
We give machine characterizations of most parameterized complexity classes, in particular, of W[P], of the classes of the W-hierarchy, and of the A-hierarchy. For example, we characterize W[P] as the class of all parameterized problems decidable by a nondeterministic fixed-parameter tractable algorithm whose number of nondeterministic steps is bounded in terms of the parameter. The machine char...
متن کاملNew Methods in Parameterized Algorithms and Complexity
i Acknowledgements First of all, I would like to thank my supervisor Pinar Heggernes for her help and guidance, both with my reasearch and with all other aspects of being a graduate student. This thesis would not have existed without her. Thomassen and Yngve Villanger. A special thanks goes to Saket Saurabh, with whom I have shared many sleepless nights and cups of coffee preparing this work. T...
متن کاملOn Miniaturized Problems in Parameterized Complexity Theory
We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of the basic theory of miniaturizations. Using the appropriate logical formalism, we show that the miniaturization of a definable problem in W[t] lies in W[t], too. In particular, the miniaturization of the dominating set problem is...
متن کاملMachine-Independent Complexity Theory
This chapter provides an accessible and straightforward tour through some of the most basic notions and remarkable phenomena in machine-independent computational complexity. It includes versions of the recursion, compression, speedup, gap, union, and honesty theorems. Where possible, the results are derived from machine-dependent ones, in the particularly convenient concrete setting of space-bo...
متن کاملMachine Characterizations for Parameterized Complexity Classes Beyond Para-NP
Due to the remarkable power of modern SAT solvers, one can efficiently solve NP-complete problems in many practical settings by encoding them into SAT. However, many important problems in various areas of computer science lie beyond NP, and thus we cannot hope for polynomial-time encodings into SAT. Recent research proposed the use of fixed-parameter tractable (fpt) reductions to provide effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.02.003